Tech Report: Scheduling Periodic Tasks on Multiple Periodic Resources

In this paper, we study the problem of scheduling periodic tasks on multiple periodic resources. We take two step approach by first integrating multiple periodic resources to an equivalent single periodic resource so that existing real-time scheduling theorems on single periodic resource can be applied. Second, we extend the schedulability tests of periodic tasks on a single periodic resource in continuous time domain given in [1] to discrete and finite time domain so that the schedulability tests can be applied in practice. We further empirically study the performance of periodic resource integration. Experiment results reveal the following interesting behaviors: 1) increasing the number of periodic resources does not necessarily increase the integrated resource’s capacity; 2) integrating smaller capacity periodic resources has higher capacity increase than integrating larger capacity periodic resources; and 3) integrating periodic resources that have the same capacity results in the most capacity increase in the integrated resource.